Method of Processing Received Signals in a Multi-Input Multi-Output (Mimo) System

ABSTRACT

A method of processing data by using a plurality of antennas and by applying weight to each signal received via a corresponding antenna in a wireless communication system is disclosed. More specifically, the method includes estimating a channel matrix corresponding to the received signal and dividing columns of the channel matrix into at least two groups. Here, each group includes at least one column. Furthermore, the method includes applying a Singular Value Decomposition (SVD) scheme to each group.

TECHNICAL FIELD

The present invention relates to a method of processing signals, and more particularly, to a method of processing received signals in a multi-input, multi-output (MIMO) system.

BACKGROUND ART

For transmitting data in high speed, a Multi-Input, Multi-Output (MIMO) system which uses a plurality of antennas to transmit and receive data. If the number of base station antennas (M) is larger than the number of mobile station antennas (N), the amount of data that can be transmitted via the downlink MIMO channel is compared to N, and the base station (BS) transmits N number of data streams simultaneously, making it high speed transmission possible. In the MIMO system for a single user, if the BS has information on the status of the downlink channel, the BS uses a Singular Value Decomposition (SVD) scheme for beam forming to increase the amount of data that can be transmitted via a channel by the increase in Signal-to-Noise Ratio (SNR) and to achieve transmission gain from parallel data streams.

FIG. 1 is a diagram illustrating a Multi-Input, Multi-Output (MIM) system. In FIG. 1, the receiving end uses a channel matrix (H) to calculate a precoding matrix (W). The receiving end can then transmit directly the calculated W as feedback to the transmitting end. Alternatively, a multiple values corresponding to the calculated W can be defined or set in advance between the transmitting end and the receiving end. The receiving end can then send as feedback an index the predefined value closest or most similar to the calculated W value.

Most of the existing closed loop MIMO algorithm uses the SVD scheme. In other words, in determining W, the SVD is applied to H^(H)H to acquire an Unitary Matrix (U), which is then used to replace W.

In addition, a signal vector (x) of the receiving end can be defined according to the following equation. x=HWs+v  [Equation 1]

In Equation 1, x represents a receiving signal vector, H represents a channel matrix, W represents a precoding matrix, s represents a transmission signal vector before being precoded, and v represents white noise.

The following Equation 2 denotes the SVD scheme applied to Equation 1. x=HUs+v  [Equation 2]

In Equation 2, U represents the Unitary Matrix acquired from applying the SVC to H^(H)H (H^(H) is a Hermitian operation of the H matrix).

Based on the characteristics of the Unitary Matrix and Equation 2, the following Equations 3-5 are formed. H^(H)H=UΣU^(H)  [Equation 3] $\begin{matrix} {\sum{= \begin{bmatrix} \sum\limits_{1}^{2} & 0 & 0 & 0 \\ 0 & \sum\limits_{2}^{2} & \cdots & 0 \\ \vdots & \vdots & \ddots & \vdots \\ 0 & 0 & \cdots & \sum\limits_{N}^{2} \end{bmatrix}}} & \left\lbrack {{Equation}\quad 4} \right\rbrack \end{matrix}$  U^(H)U=I  [Equation 5]

At the same time, to attain a transmission signal vector s, the following equation is used. s=U ^(H) H ^(H) x=U ^(H) H ^(H) HUs+U ^(H) H ^(H) v=Σs+Σ ^(1/2) v

As illustrated in Equation 6, the receiving end relies on the value of $\sum\limits_{k}^{2}$ to restore the transmission signal s. Here, k=1, 2, . . . , N and N represents a number of transmission antennas. That is, because the value of $\sum\limits_{k}^{2}$ corresponds with the value of the SNR, having a large SNR means that the restoring capability of the signal is outstanding.

However, because the value of $\sum\limits_{k}^{2}$ includes the status of channels corresponding to all of the transmission antennas, the values of $\sum\limits_{k}^{2}$ cannot all be outstanding.

As an illustration of this point, assume that H is a 4×4 matrix. H can be represented according to the following equation. H=[H₁H₂H₃H₄]  [Equation 7]

In Equation 7, H is represented by four columns, and each column signifies a channel corresponding to transmission signal transmitted via a transmission antenna. If all four channels maintain orthogonal relationship with each other, there is no interference among signals transmitted via each antenna. However, in operation, it is difficult for each column to maintain orthogonality with each other column. As such, there exists interference among signals transmitted via each antenna. The rate of interference increases with a number of columns with respect to the rate of non-orthogonal relationship between each column. As discussed above, with the increase in interference, the value of $\sum\limits_{k}^{2}$ decreases, and the decreased $\sum\limits_{k}^{2}$ value is the reason for a small SNR, thus lowering the quality of the received signal.

DISCLOSURE OF THE INVENTION

Accordingly, the present invention is directed to a method of processing received signals in a Multi-Input, Multi-Output (MIMO) system that substantially obviates one or more problems due to limitations and disadvantages of the related art.

An object of the present invention is to provide a method of processing data by using a plurality of antennas and by applying weight to each signal received via a corresponding antenna in a wireless communication system.

Additional advantages, objects, and features of the invention will be set forth in part in the description which follows and in part will become apparent to those having ordinary skill in the art upon examination of the following or may be learned from practice of the invention. The objectives and other advantages of the invention may be realized and attained by the structure particularly pointed out in the written description and claims hereof as well as the appended drawings.

To achieve these objects and other advantages and in accordance with the purpose of the invention, as embodied and broadly described herein, a method processing data includes estimating a channel matrix corresponding to the received signal and dividing columns of the channel matrix into at least two groups. Here, each group includes at least one column. Furthermore, the method includes applying a Singular Value Decomposition (SVD) scheme to each group.

In another aspect of the present invention, a method of processing data includes receiving a feedback information, where the feedback information includes at least one preceding matrix calculated from the SVD scheme applied to the group. Moreover, the method further includes transmitting a transmission signal using a preceding matrix.

Furthermore, in another aspect of the present invention, a method of processing data includes transmitting a feedback information from a receiving end, where the feedback information includes at least one precoding matrix calculated from the SVD scheme applied to the group. Moreover, the method includes receiving the feedback information, which includes the at least one preceding matrix calculated from the SVD scheme applied to the group, in a transmitting end, and transmitting a transmission signal using a preceding matrix from the transmitting end. Lastly, the method includes receiving the transmission signal having the precoding matrix applied thereto in the receiving end.

It is to be understood that both the foregoing general description and the following detailed description of the present invention are exemplary and explanatory and are intended to provide further explanation of the invention as claimed.

BRIEF DESCRIPTION OF THE DRAWINGS

The accompanying drawings, which are included to provide a further understanding of the invention and are incorporated in and constitute a part of this application, illustrate embodiment(s) of the invention and together with the description serve to explain the principle of the invention. In the drawings;

FIG. 1 is a diagram illustrating a Multi-Input, Multi-Output (MIM) system; and

FIG. 2 is a diagram illustrating a MIMO system according to the embodiment of the present invention.

BEST MODE FOR CARRYING OUT THE INVENTION

Reference will now be made in detail to the preferred embodiments of the present invention, examples of which are illustrated in the accompanying drawings. Wherever possible, the same reference numbers will be used throughout the drawings to refer to the same or like parts.

As discussed above, H represent a channel matrix which is estimated from the signal transmitted from the transmitting end. The columns of the channel matrix are then divided into at least two groups. Here, each group consists of at least one column, and at the same time, the column of one group only belongs to one group. In other words, the column(s) of each group is different and no group shares the same column. Furthermore, in order to attain the largest Σ (or singular value), a singular value decomposition (SVD) scheme is applied to each group.

In the MIMO system, there are two methods by which feedback information related to channel status can be transmitted to the transmitting end. First method relates to directly providing the channel matrix information as feedback, and the second method relates to providing as feedback the precoding matrix information calculated from the channel matrix. More specifically, the precoding matrix is calculated from the SVD scheme applied to each group.

Hereafter, a method of sending as feedback the precoding matrix information according to an embodiment of the present invention will be described. FIG. 2 is a diagram illustrating a MIMO system according to the embodiment of the present invention. W₁ of FIG. 2 can be by the matrix of Equation 8. $\begin{matrix} {W_{1} = \begin{bmatrix} u_{f} & 0 \\ 0 & u_{s} \end{bmatrix}} & \left\lbrack {{Equation}\quad 8} \right\rbrack \end{matrix}$

After H is determined at the receiving end, u_(f) and u_(s) can be determined using the following Equation 9. $\begin{matrix} {{\begin{bmatrix} I & 0 \\ 0 & 0 \end{bmatrix}H^{H}{H\begin{bmatrix} I & 0 \\ 0 & 0 \end{bmatrix}}} = {{{{{\begin{bmatrix} u_{f}^{H} & 0 \\ 0 & 0 \end{bmatrix}\begin{bmatrix} \sum\limits_{f}^{2} & 0 \\ 0 & 0 \end{bmatrix}}\begin{bmatrix} u_{f} & 0 \\ 0 & 0 \end{bmatrix}}\begin{bmatrix} 0 & 0 \\ 0 & I \end{bmatrix}}H^{T}{H\begin{bmatrix} 0 & 0 \\ 0 & I \end{bmatrix}}} = {{\begin{bmatrix} 0 & 0 \\ 0 & u_{s}^{H} \end{bmatrix}\begin{bmatrix} 0 & 0 \\ 0 & \sum\limits_{s}^{2} \end{bmatrix}}\begin{bmatrix} 0 & 0 \\ 0 & u_{s} \end{bmatrix}}}} & \left\lbrack {{Equation}\quad 9} \right\rbrack \end{matrix}$

Here, the receiving end can send as feedback u_(f) and u_(s) calculated by using Equation 9 to the transmitting end. Alternatively, the receiving end can send as feedback to the transmitting end a matrix having the closest or most similar matrix from a plurality of predefined matrices. Subsequently, the transmitting end can process the received u_(f) and u_(s) according the following Equation 10. $\begin{matrix} {z = {\begin{bmatrix} u_{f} & 0 \\ 0 & u_{s} \end{bmatrix}s}} & \left\lbrack {{Equation}\quad 10} \right\rbrack \end{matrix}$

In Equation 10, z represents a signal vector received from the transmitting antenna, and s represents a signal vector before being precoded.

The process of detecting or identifying the original signal(s) from the received signal(s) of the receiving end can be defined according to Equations 11-13. With respect to Equation 10, the received signal can be represented as shown in Equation 11. x=Hz+v  [Equation 11]

At the same time, s can be represented as shown in Equation 12. $\begin{matrix} {s = \begin{bmatrix} s_{f} \\ s_{s} \end{bmatrix}} & \left\lbrack {{Equation}\quad 12} \right\rbrack \end{matrix}$

Furthermore, s_(f) and s_(s) can be calculated according to Equation 13. $\begin{matrix} \begin{matrix} \begin{matrix} {\overset{\Lambda}{s_{f}} = {{decision}\quad\left( {\begin{bmatrix} u_{f}^{H} & 0 \\ 0 & 0 \end{bmatrix}H^{H}x} \right)}} \\ {y = {x - {{H\begin{bmatrix} u_{f}^{H} & 0 \\ 0 & 0 \end{bmatrix}}\begin{bmatrix} \overset{\Lambda}{s_{f}} \\ 0 \end{bmatrix}}}} \end{matrix} \\ {\overset{\Lambda}{s_{s}} = {{decision}\quad\left( {\begin{bmatrix} 0 & 0 \\ 0 & u_{s}^{H} \end{bmatrix}H^{H}y} \right)}} \end{matrix} & \left\lbrack {{Equation}\quad 13} \right\rbrack \end{matrix}$

As an embodiment of the present invention, a channel matrix H can be a 4×4 matrix. Here, if the SVD scheme is applied to all four columns, the value of $\sum\limits_{k}^{2}\quad$ is small due to interference caused by non-orthogonal relationship between too many columns.

In order to acquire a larger $\sum\limits_{k}^{2}$ value, each column of the H matrix has to have orthogonal relationship with another column or reduces a number of columns by applying the SVD scheme. However, because the number of columns (e.g., four columns) are determined based on the channel status, the number of columns cannot be changed unilaterally.

As one of a method of reducing the number of columns in the matrix by applying the SVD scheme, a specified number (not all) of antennas can be used to transmit signals. Here, for example, two out of four antennas can be used to transmit signals. Another method of reducing the number of columns is by grouping specific columns and applying the SVD scheme thereto.

According to the method of using a specified number of antennas, an Adaptive Modulation and Coding (AMC) scheme can be used. Here, if the AMC scheme is not used, data throughput can fall. However, despite the benefit and the necessity of using the AMC scheme, reconstructing and/or control is complicated, and hence, the AMC scheme is difficult to use in practice.

Consequently, it may be more effective and efficient to apply the SVD scheme to the grouped columns of the matrix. The following equation, Equation 14, shows applying SVD scheme to the grouped columns. $\begin{matrix} {{\begin{bmatrix} I & 0 \\ 0 & 0 \end{bmatrix}H^{H}{H\begin{bmatrix} I & 0 \\ 0 & 0 \end{bmatrix}}} = {{\begin{bmatrix} u_{f}^{H} & 0 \\ 0 & 0 \end{bmatrix}\begin{bmatrix} {\sum\limits_{f}^{2}\quad} & 0 \\ 0 & 0 \end{bmatrix}}\begin{bmatrix} u_{f} & 0 \\ 0 & 0 \end{bmatrix}}} & \left\lbrack {{Equation}\quad 14} \right\rbrack \\ {{\begin{bmatrix} 0 & 0 \\ 0 & I \end{bmatrix}H^{H}{H\begin{bmatrix} 0 & 0 \\ 0 & I \end{bmatrix}}} = {{\begin{bmatrix} 0 & 0 \\ 0 & u_{s}^{H} \end{bmatrix}\begin{bmatrix} 0 & 0 \\ 0 & {\sum\limits_{s}^{2}\quad} \end{bmatrix}}\begin{bmatrix} 0 & 0 \\ 0 & u_{s} \end{bmatrix}}} & \quad \end{matrix}$

In Equation 14, $\sum\limits_{f}^{2}\quad{{and}\quad\sum\limits_{s}^{2}}$ are represented in Equation 15. $\begin{matrix} {{\sum\limits_{f}^{2}{= \begin{bmatrix} \sum\limits_{f\quad 1}^{2} & 0 \\ 0 & \sum\limits_{f\quad 2}^{2} \end{bmatrix}}},{\sum\limits_{s}^{2}{= \begin{bmatrix} \sum\limits_{s\quad 1}^{2} & 0 \\ 0 & \sum\limits_{s\quad 2}^{2} \end{bmatrix}}}} & \left\lbrack {{Equation}\quad 15} \right\rbrack \end{matrix}$ $\sum\limits_{f\quad 1}^{2}{,{\sum\limits_{f\quad 2}^{2}{,{\sum\limits_{s\quad 1}^{2}{,\quad{{and}\quad\sum\limits_{s\quad 2}^{2}}}}}}}$ are acquired from using two out of four columns. As a result, these values are larger than $\sum\limits_{k}^{2}$ which is acquired from using all four columns.

In the receiving end, signals can be detected or identified by using methods such as Zero Forcing (ZF), Minimum Mean Square Error (MMSE), and Interference Canceling (IC).

In the embodiment of the present invention, $\sum\limits_{f\quad 1}^{2}{,{\sum\limits_{f\quad 2}^{2}{,{\sum\limits_{s\quad 1}^{2}{,\quad{{and}\quad\sum\limits_{s\quad 2}^{2}}}}}}}$ change according to different combinations of the H matrix columns. As shown in Equation 16, there can be a plurality of combinations of columns. From the combination of columns, a permutation matrix having the best or largest ${\sum\limits_{f\quad 1}^{2}\quad{,{\sum\limits_{f\quad 2}^{2}\quad{,{\sum\limits_{s\quad 1}^{2}\quad{,{{and}\underset{s\quad 2}{\overset{2}{\quad\sum}}}}}}}}}\quad$ can be selected or determined. $\begin{matrix} {{\begin{bmatrix} I & 0 \\ 0 & 0 \end{bmatrix}P^{H}P^{H}{{HP}\begin{bmatrix} I & 0 \\ 0 & 0 \end{bmatrix}}} = {{{{{\begin{bmatrix} u_{f}^{H} & 0 \\ 0 & 0 \end{bmatrix}\begin{bmatrix} {\sum\limits_{f}^{2}\quad} & 0 \\ 0 & 0 \end{bmatrix}}\begin{bmatrix} u_{f} & 0 \\ 0 & 0 \end{bmatrix}}\begin{bmatrix} 0 & 0 \\ 0 & I \end{bmatrix}}P^{H}P^{H}{{HP}\begin{bmatrix} 0 & 0 \\ 0 & I \end{bmatrix}}} = {{\begin{bmatrix} 0 & 0 \\ 0 & u_{s}^{H} \end{bmatrix}\begin{bmatrix} {0\quad} & 0 \\ 0 & \sum\limits_{s}^{2} \end{bmatrix}}\begin{bmatrix} 0 & 0 \\ 0 & u_{s} \end{bmatrix}}}} & \left\lbrack {{Equation}\quad 16} \right\} \end{matrix}$

In Equation 16, P represents a permutation matrix. If the receiving end determines or selects the permutation matrix, the permutation matrix determined at the transmitting end can be sent as feedback.

Lastly, if the information being sent as feedback from the receiving end is information of its channel matrix, the transmitting end can apply the SVD scheme to the columns of the channel matrix.

The embodiment of the present invention is not limited a channel matrix having a 4×4 matrix, but be any size (e.g., n×n).

It will be apparent to those skilled in the art that various modifications and variations can be made in the present invention without departing from the spirit or scope of the inventions. Thus, it is intended that the present invention covers the modifications and variations of this invention provided they come within the scope of the appended claims and their equivalents. 

1. A method of processing data by using a plurality of antennas and by applying weight to each signal received via a corresponding antenna in a wireless communication system, the method comprising: estimating a channel matrix corresponding to the received signal; dividing columns of the channel matrix into at least two groups, wherein each group includes at least one column; and applying a Singular Value Decomposition (SVD) scheme to each group.
 2. The method of claim 1, further comprising: transmitting a feedback information; and receiving a transmission signal, wherein the transmission signal has a precoding matrix applied thereto.
 3. The method of claim 2, wherein the feedback information includes values of elements of the precoding matrix, wherein the preceding matrix is calculated from the SVD schemed applied to the group, or an index of a code book, the code book is comprised of a plurality of matrices.
 4. The method of claim 2, further comprising: the precoding matrix most similar to a calculated precoding matrix selected from a plurality of predefined precoding matrices, wherein the precoding matrix is calculated from the SVD schemed applied to the group; and transmitting at least one index of the selected predefined precoding matrix.
 5. The method of claim 1, wherein a number of groups is determined for the purpose of optimizing singular values of the at least two groups.
 6. The method of claim 5, wherein optimizing the singular values includes maximizing a maximum singular value selected from all the groups.
 7. The method of claim 5, wherein optimizing the singular values includes maximizing a minimum singular value selected from all the groups.
 8. The method of claim 5, wherein optimizing the singular values includes maximizing a sum of all the singular values from all the groups or a product of all the singular values from all the groups.
 9. The method of claim 5, wherein optimizing the singular values includes maximizing a sum of maximum singular values selected from each group or a product of maximum singular values selected from each group.
 10. The method of claim 5, wherein optimizing the singular values includes maximizing a sum of minimum singular values selected from each group or a product of minimum singular values selected from each group.
 11. The method of claim 1, wherein a size of each group is determined for the purpose of optimizing singular values of the at least two groups.
 12. The method of claim 11, wherein optimizing the singular values includes maximizing a maximum singular value selected from all the groups.
 13. The method of claim 1, wherein optimizing the singular values includes maximizing a minimum singular value selected from all the groups.
 14. The method of claim 11, wherein optimizing the singular values includes maximizing a sum of all the singular values from all the groups or a product of all the singular values from all the groups.
 15. The method of claim 11, wherein optimizing the singular values includes maximizing a sum of maximum singular values selected from each group or a product of maximum singular values selected from each group.
 16. The method of claim 11, wherein optimizing the singular values includes maximizing a sum of minimum singular values selected from each group or a product of minimum singular values selected from each group.
 17. The method of claim 1, wherein each column of the channel matrix included in a first group is different from each column of the matrix included in a second group.
 18. The method of claim 1, wherein the column of the channel matrix included in a first group is different from each column of the matrix included in a second group.
 19. The method of claim 1, wherein each column of the channel matrix included in a first group is different from the column of the matrix included in a second group.
 20. A method of processing data by using a plurality of antennas and by applying weight to each signal received via a corresponding antenna in a wireless communication system, the method comprising: receiving a feedback information, wherein the feedback information includes at least one precoding matrix calculated from the SVD scheme applied to the group; and transmitting a transmission signal using a preceding matrix.
 21. The method of claim 20, wherein the feedback information includes values of elements of the preceding matrix or an index of a code book, the code book is comprised of a plurality of matrices.
 22. The method of claim 20, further comprising receiving an index of a selected predefined precoding matrix, wherein the selected predefined precoding matrix is a precoding matrix most similar to the calculated precoding matrix selected from a plurality of predefined preceding matrices.
 23. The method of claim 20, wherein a number of groups or a size of each group is determined for the purpose of optimizing singular values of the at least two groups.
 24. The method of claim 23, wherein optimizing the singular values includes maximizing a maximum singular value selected from all the groups.
 25. The method of claim 23, wherein optimizing the singular values includes maximizing a minimum singular value selected from all the groups.
 26. The method of claim 23, wherein optimizing the singular values includes maximizing a sum of all the singular values from all the groups or a product of all the singular values from all the groups.
 27. The method of claim 23, wherein optimizing the singular values includes maximizing a sum of maximum singular values selected from each group or a product of maximum singular values selected from each group.
 28. The method of claim 23, wherein optimizing the singular values includes maximizing a sum of minimum singular values selected from each group or a product of minimum singular values selected from each group.
 29. The method of claim 20, wherein each column of the channel matrix included in a first group is different from each column of the matrix included in a second group.
 30. The method of claim 1, further comprising: transmitting a feedback information from a receiving end, wherein the feedback information includes at least one precoding matrix calculated from the SVD scheme applied to the group; receiving the feedback information, which includes the at least one precoding matrix calculated from the SVD scheme applied to the group, in a transmitting end; transmitting a transmission signal using a preceding matrix from the transmitting end; and receiving the transmission signal having the precoding matrix applied thereto in the receiving end.
 31. The method of claim 30, wherein the feedback information includes values of elements of the preceding matrix or an index of a code book, the code book is comprised of a plurality of matrices.
 32. The method of claim 30, further comprising: selecting from a plurality of predefined precoding matrices a precoding matrix most similar to the calculated precoding matrix; and transmitting an index of the selected predefined precoding matrix. 